Euclidean rings
نویسندگان
چکیده
منابع مشابه
About Euclidean Rings
In this article all rings are commutative with unit, all modules are unitary. Given a ring A, its multiplicative group of units (i.e. invertible elements) is denoted by A*. The customary definition of a Euclidean ring is that it is a domain A together with a map F : A + N (the nonnegative integers) such that (1) I : p(a) for a, b E r3 (0); (2) given a, b E -‘-I, b m;’ 0, there exist q and Y in ...
متن کاملOn Signature-Based Gröbner Bases Over Euclidean Rings
In this paper we present first steps in using signature-based Gröbner basis algorithms like Faugère’s F5 or GVW for computation over Euclidean rings. We present problems appearing when having to deal with coefficients and zero divisors and give practical solution techniques. A hybrid algorithm is presented trying to combine the advantages of signature-based and non-signature-based Gröbner basis...
متن کاملEuclidean Weights of Codes from Elliptic Curves over Rings
We construct certain error-correcting codes over finite rings and estimate their parameters. For this purpose, we need to develop some tools, notably an estimate for certain exponential sums and some results on canonical lifts of elliptic curves. These results may be of independent interest.
متن کاملThe Ring of Integers, Euclidean Rings and Modulo Integers
The binary operation multint on Z is defined as follows: (Def. 1) For all elements a, b of Z holds (multint)(a, b) = ·R(a, b). The unary operation compint on Z is defined as follows: (Def. 2) For every element a of Z holds (compint)(a) = −R(a). The double loop structure INT.Ring is defined by: (Def. 3) INT.Ring = 〈Z, +Z,multint, 1(∈ Z), 0(∈ Z)〉. Let us mention that INT.Ring is strict and non em...
متن کاملSecure Accumulators from Euclidean Rings without Trusted Setup
Cryptographic accumulators are well-known to be useful in many situations. However, the most efficient accumulator (the RSA accumulator) it is not secure against a certificate authority who has herself selected the RSA modulus n. We generalize previous work and define the root accumulator in modules over Euclidean rings. We prove that the root accumulator is secure under two different pairs of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Faculty of Science, Ibaraki University. Series A, Mathematics
سال: 1986
ISSN: 1883-4345,0579-3068
DOI: 10.5036/bfsiu1968.18.1